Problems with computational methods in population ge - netics
نویسنده
چکیده
Advances in computational power, statistical methodology, and population genetics theory have recently had an impact on the way in which information is extracted from molecular genetic data. Several computationally intensive schemes have already been developed for analysis of such data under simple models (see for example Gri ths and Tavar e, 1994; Kuhner et al., 1995; Wilson and Balding, 1998), and their popularity will no-doubt increase as they become able to incorporate more biologically-realistic assumptions. It is important to recognize that these methods are being used to tackle di cult problems which are extremely challenging, even using the sophisticated theory and technology now available. Since these methods are likely to be widely applied by people who are not experts in computational statistics, it is particularly important to develop methods which are easily used to produce reliable results. This piece aims to describe one sense in which some current approaches are more likely to provide reliable results than others.
منابع مشابه
The computational study of adsorption of carbon monoxide on pristine and Ge-doped (6,0) zigzag models of BNNTs
The aim of this research is studying the effects of Ge-doped on CO adsorption on the outer and inner surfaces of (6, 0) zigzag model of boron nitride nanotube (BNNTs) by using DFT theory. For this purpose, eight models of CO adsorption on the surfaces of BNNTs are considered. At first step, all structures were optimized at B3LYP and 6-31G (d) standard base set and then the electronic structure,...
متن کاملشیوع چاقی عمومی وچاقی مرکزی و فاکتورهای مرتبط با آن در جمعیت بزرگسال شهرستان یزد درسال1394-1393
Introduction: Obesity as one of the most important public health problems is growing worldwide and it is associated with many non-communicable diseases. The aim of this study was investigating the prevalence of general obesity and central obesity and their related factors. Methods: The data of this research were extracted from a population health survey of Yazd province, Iran (YaHS), which was...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملNew Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in CSPs. In this paper we analyse the structure of symmet...
متن کاملThe Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999